The RHMC Algorithm for 2 Flavours of Dynamical Staggered Fermions
نویسندگان
چکیده
Computations with two flavours of dynamical staggered quarks are quite popular at present. There are a number of possible problems with such calculations such as flavour symmetry breaking and non-locality of the square-root of the fourflavour action. In this investigation we shall ignore these and consider only the possible errors introduced through algorithmic approximations. We propose the use of the Rational Hybrid Monte Carlo (RHMC) algorithm [1]. This method is stochastically exact, in the sense that it is free from molecular dynamics (MD) stepsize errors. It is comparable to the usual R algorithm [2] in performance, but without the need for extrapolation in the MD stepsize δt.
منابع مشابه
Comparing the R algorithm and RHMC for staggered fermions
The R algorithm is widely used for simulating two flavours of dynamical staggered fermions. We give a simple proof that the algorithm converges to the desired probability distribution to within O(δτ ) errors, but show that the relevant expansion parameter is (δτ/m), m being the quark mass. The Rational Hybrid Monte Carlo (RHMC) algorithm provides an exact (i.e., has no step size errors) alterna...
متن کاملA New Exact Method for Dynamical Fermion Computations with Non-Local Actions
The RHMC algorithm is an exact method for generating lattice configurations distributed according to some non-local action. Both the terms ‘non-local’ and ‘exact’ require some explanation. By a non-local action we mean one which is constructed from some continuous function of a local kernel, for example ψ̄ √ Mψ where M is the usual staggered kernel; we do not mean an action with complicated long...
متن کاملAccelerating lattice QCD simulations with 2 flavours of staggered fermions on multiple GPUs using OpenACC - a first attempt
We present the results of an effort to accelerate a Rational Hybrid Monte Carlo (RHMC) program for lattice quantum chromodynamics (QCD) simulation for 2 flavours of staggered fermions on multiple Kepler K20X GPUs distributed on different nodes of a Cray XC30. We do not use CUDA but adopt a higher level directive based programming approach using the OpenACC platform. The lattice QCD algorithm is...
متن کاملAlgorithm Shootout: R versus RHMC
We present initial results comparing the RHMC and R algorithms on large lattices with small quark masses using chiral fermions. We also present results concerning staggered fermions near the deconfinement/chiral phase transition. We find that the RHMC algorithm not only eliminates the step-size error of the R algorithm, but is also considerably more efficient. We discuss several possibilities f...
متن کاملAlgorithms for Dynamical Fermions
This is the write-up of three lectures on algorithms for dynamical fermions that were given at the ILFTN workshop ‘Perspectives in Lattice QCD’ in Nara during November 2005. The first lecture is on the fundamentals of Markov Chain Monte Carlo methods and introduces the Hybrid Monte Carlo (HMC) algorithm and symplectic integrators; the second lecture covers topics in approximation theory and the...
متن کامل